Revisiting Partial-Order Probabilistic Plannin
نویسندگان
چکیده
We present a partial-order probabilistic planning algorithm that adapts plan-graph based heuristics implemented in Repop. We describe our implemented planner, Reburidan, named after its predecessors Repop and Buridan. Reburidan uses plan-graph based heuristics to first generate a base plan. It then improves this plan using plan refinement heuristics based on the success probability of subgoals. Our initial experiments show that these heuristics are effective in improving Buridan significantly.
منابع مشابه
Design Tradeoffs in Partial Order (Plan space) Planning
Despite the IonB history of classical plmming, there has been very little compsrative analysis of the performance tradeoffs offered by the multitude of existin8 planning alSodthms. This is partly due to the many different vocabularies within which planning algorithms are usually expressed. In this paper I provide a generalized algorithm for refinemant planning, and dhow that planners that searc...
متن کاملProbapop: Probabilistic Partial-Order Planning
We describe Probapop, a partial-order probabilistic planning system. Probapop is a blind (conformant) planner that finds plans for domains involving probabilistic actions but no observability. The Probapop implementation is based on Vhpop, a partial-order deterministic planner written in C++. The Probapop algorithm uses plan graph based heuristics for selecting a plan from the search queue, and...
متن کاملtion for Plannin Under Uncertainty
The virtue of the STRIPS assumption for planning is that it bounds the information relevant to determining the effects of actions. Viewing the “assumption” as a statement about beliefs, we find that it does not actually assume anything about the world itself. We can characterize the assertion about beliefs in terms of probabilistic independence, thereby facilitating analysis of representations ...
متن کاملPartial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both linear time and branching time specifications, methods have been developed to apply partial order reduction in the context of model checking. Only recently, results were published that give criteria on applying partial ord...
متن کاملWhy Confluence is More Powerful than Ample Sets in Probabilistic and Non-Probabilistic Branching Time
Confluence reduction and partial order reduction by means of ample sets are two different techniques for state space reduction in both traditional and probabilistic model checking. This presentation provides an extensive comparison between these two methods, answering the long-standing question of how they relate. We show that, while both preserve branching time properties, confluence reduction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003